An Improved Algorithm for the Minimum Manhattan Network Problem
نویسندگان
چکیده
For a set S of n points in the plane, a Manhattan network on S is a geometric network G(S) such that, for each pair of points in S, G(S) contains a rectilinear path between them of length equal to their distance in the L1-metric. The minimum Manhattan network problem is a problem of finding a Manhattan network of minimum length. Gudmundsson, Levcopoulos, and Narasimhan proposed a 4-approximation algorithm and conjectured that there is a 2-approximation algorithm for this problem. In this paper, based on a different approach, we improve their bound and present a 2-approximation algorithm.
منابع مشابه
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
We consider the generalized minimum Manhattan network problem (GMMN). The input to this problem is a set R of n pairs of terminals, which are points in R. The goal is to find a minimum-length rectilinear network that connects every pair in R by a Manhattan path, that is, a path of axis-parallel line segments whose total length equals the pair’s Manhattan distance. This problem is a generalizati...
متن کاملImproved Binary Particle Swarm Optimization Based TNEP Considering Network Losses, Voltage Level, and Uncertainty in Demand
Transmission network expansion planning (TNEP) is an important component of power system planning. Itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. Different methods have been proposed for the solution of the static transmissionnetwork expansion planning (STNEP) problem till now. But in all of them, STNEP pr...
متن کاملA Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P . Aminimum Manhattan network of P is a Manhattan network of minimum total length. It is unknown whether it is NP-hard to construct a minimum Manhattan network. The best approximations published so far are a combinatorial 3-approximation algori...
متن کاملThe Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Given a set of nodes in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of nodes, the ratio of the network distance and the Euclidean distance of the two nodes is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-) m...
متن کاملPresenting an evolutionary improved algorithm for the multi-objective problem of distribution network reconfiguration in the presence of distributed generation sources and capacitor units with regard to load uncertainty.
Reconfiguration of distribution network feeders is one of the well-known and effective strategies in the distribution network to obtain a new optimal configuration for the distribution feeders by managing the status of switches in the distribution network. This study formulates the multi-objective problem of reconfiguration of a distribution network in the optimal presence of distributed genera...
متن کامل